On an Algorithm for a Double-resolvability Test
نویسندگان
چکیده
To find all doubly resolvable designs with definite parameters, we construct the design resolutions in lexicographic order point by point. To partial solutions with more than 2/3 of the points we apply a double-resolvability test, namely we try to construct an orthogonal resolution. The test reduces significantly the number of partial solutions, and is very important for the efficiency of the whole computation. We develop and compare two algorithms for a double-resolvability test. The first one implies construction of the orthogonal resolution block by block (BB), while the second one does it class by class (CC). We present experimental results on the performance of both algorithms. Applying them, we also classify for the first time doubly resolvable 2-(16,4,2) and 2-(8,4,18) designs.
منابع مشابه
AN OPTIMIZATION-BASED COMPARATIVE STUDY OF DOUBLE LAYER GRIDS WITH TWO DIFFERENT CONFIGURATIONS USING CUCKOO SEARCH ALGORITHM
This paper is concerned with the economical comparison between two commonly used configurations for double layer grids and determining their optimum span-depth ratio. Two ranges of spans as small and big sizes with certain bays of equal length in two directions and various types of element grouping are considered for each type of square grids. In order to carry out a precise comparison between ...
متن کاملA NEW HYBRID ALGORITHM FOR TOPOLOGY OPTIMIZATION OF DOUBLE LAYER GRIGS
In this paper, for topology optimization of double layer grids, an efficient optimization method is presented by combination of Imperialist Competitive Algorithm (ICA) and Gravitational Search Algorithm (GSA) which is called ICA-GSA method. The present hybrid method is based on ICA but the moving of countries toward their relevant imperialist is done using the la...
متن کاملA new approach based on data envelopment analysis with double frontiers for ranking the discovered rules from data mining
Data envelopment analysis (DEA) is a relatively new data oriented approach to evaluate performance of a set of peer entities called decision-making units (DMUs) that convert multiple inputs into multiple outputs. Within a relative limited period, DEA has been converted into a strong quantitative and analytical tool to measure and evaluate performance. In an article written by Toloo et al. (2009...
متن کاملω-NARROWNESS AND RESOLVABILITY OF TOPOLOGICAL GENERALIZED GROUPS
Abstract. A topological group H is called ω -narrow if for every neighbourhood V of it’s identity element there exists a countable set A such that V A = H = AV. A semigroup G is called a generalized group if for any x ∈ G there exists a unique element e(x) ∈ G such that xe(x) = e(x)x = x and for every x ∈ G there exists x − 1 ∈ G such that x − 1x = xx − 1 = e(x). Also le...
متن کاملA Comparative Study of Multi-Attribute Continuous Double Auction Mechanisms
Auctions have been as a competitive method of buying and selling valuable or rare items for a long time. Single-sided auctions in which participants negotiate on a single attribute (e.g. price) are very popular. Double auctions and negotiation on multiple attributes create more advantages compared to single-sided and single-attribute auctions. Nonetheless, this adds the complexity of the auctio...
متن کامل